On the Expressive Power of Stateless Ordered Restart-Delete Automata
نویسندگان
چکیده
Abstract Stateless ordered restart-delete automata (stl-ORD-automata) are studied. These obtained from the stateless restarting (stl-ORWW-automata) by introducing an additional operation, which, based on surrounding context, deletes a single letter. While stl-ORWW-automata accept regular languages, we show that swift stl-ORD-automata yield characterization for class of context-free languages. Here stl-ORD-automaton is called if it can move its window to any position after performing restart. We also study descriptional complexity and relate them limited context automata.
منابع مشابه
On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we present a construction that yields an equivalent NFA of size 2 from a stateless deterministic ordered restarting automaton that works on a...
متن کاملExpressive Power of Pebble Automata
Two variants of pebble tree-walking automata on trees are considered that were introduced in the literature. It is shown that for each number of pebbles, the two models have the same expressive power both in the deterministic case and in the nondeterministic case. Furthermore, nondeterministic (resp. deterministic) treewalking automata with n+ 1 pebbles can recognize more languages than those w...
متن کاملOn the Expressive Power of 2-Stack Visibly Pushdown Automata
Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La Torre, Madhusudan, and Parlato, who exploit the concept of visibility further to obtain a rich pushdown-automata cla...
متن کاملOn Stateless Automata and P Systems
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems...
متن کاملOn CD-systems of stateless deterministic R-automata with window size one
Here we study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of computing systems
سال: 2021
ISSN: ['1432-4350', '1433-0490']
DOI: https://doi.org/10.1007/s00224-020-10028-3